A note on constructing permutation polynomials
نویسندگان
چکیده
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for constructing permutation polynomials over the field using a bijective map from H to a coset of H. A similar, but inequivalent, method for lifting permutation behaviour of a polynomial to an extension field is also given.
منابع مشابه
On constructing permutations of finite fields
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.
متن کاملA general representation theory for constructing groups of permutation polynomials
Using the left regular action of a group on itself, we develop a general representation theory for constructing groups of permutation polynomials. As an application of the method, we compute polynomial representations of several abelian and nonabelian groups, and we determine the equivalence classes of the groups of polynomials we construct. In particular, when the size of the group is equal to...
متن کاملSeveral Classes of Permutation Trinomials over $\mathbb F_{5^n}$ From Niho Exponents
The construction of permutation trinomials over finite fields attracts people’s interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by constructing some new fractional polynomials that permute the set of the (q + 1)-th roots of unity in Fq2 , we present several classes of permutat...
متن کاملA New Class of Permutation Polynomials over Finite Fields
In this paper, the problem of constructing permutation polynomials over finite fields is investigated. By using the piecewise method, a class of permutation polynomials of the form (x − x + c) k(q 2−1) d +1 + x + x over Fq2 is constructed, where 1 ≤ k < d and d is an arbitrary factor of q − 1, which generalizes some known results in the literature.
متن کاملPermutation Polynomials modulo m
This paper mainly studies problems about so called “permutation polynomials modulo m”, polynomials with integer coefficients that can induce bijections over Zm = {0, · · · , m−1}. The necessary and sufficient conditions of permutation polynomials are given, and the number of all permutation polynomials of given degree and the number induced bijections are estimated. A method is proposed to dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 15 شماره
صفحات -
تاریخ انتشار 2009